Generalized metrics and uniquely determined logic programs

Generalized metrics and uniquely determined logic programs

Embedding Defeasible Logic Programs into Generalized Logic Programs

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...

Generalized Quantifiers in Logic Programs

Generalized quantiiers are an important concept in model-theoretic logic which has applications in diierent elds such as linguistics , philosophical logic and computer science. In this paper, we consider a novel application in the eld of logic programming, which has been presented recently. The enhancement of logic programs by generalized quantiiers is a convenient tool for interfacing extra-lo...

A Metrics Suite for Concurrent Logic Programs

A large body of research in the measurement of software complexity has been focused on imperative programs, but little e ort has been made for logic programs. In this paper, a set of complexity metrics for concurrent logic programs are proposed, which are speci cally designed to quantify the information ow of concurrent logic programs. These metrics are de ned based on the argument dependence n...

On uniquely k-determined permutations

Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria for a permutation to be uniquely k-determined: one in terms of the distance between two consecutive elements in a permutation, and the other one in terms of directed hamiltonian paths in the certain graphs called path-...